منابع مشابه
The Tenacity of Zero-One Laws
The Ehrenfeucht-Fraisse game is a two-person game of perfect information which is connected to the Zero-One Laws of first order logic. We give bounds for roughly how quickly the Zero-One Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second player (“Duplicator”) in playing the EhrenfeuchtFraisse game, by bounding the numbers of moves ...
متن کاملOn Zero-one Laws
An extension of a topological zero-one law due to M. and K.P.S. Bhaskara Rao and of the Hewitt-Savage zero-one law is presented. In [8] M. and K.P.S. Bhaskara Rao proved the following topological zeroone law, which we shall refer to as the Bhaskara Rao zero-one law. Theorem 1. Let X be a topological space and let $ be a group of homeomorphisms of X onto itself with the property that for any two...
متن کاملThe generality of the zero-one laws
We prove game-theoretic generalizations of some well-known zero-one laws. Our proofs make the martingales behind the laws explicit, and our results illustrate how martingale arguments can have implications going beyond measure-theoretic probability.
متن کاملSufficient Conditions for Zero-one Laws
We generalize a result of Bateman and Erdős concerning partitions, thereby answering a question of Compton. From this result it follows that if K is a class of finite relational structures that is closed under the formation of disjoint unions and the extraction of components, and if it has the property that the number of indecomposables of size n is bounded above by a polynomial in n, then K ha...
متن کاملZero-One Laws for Modal Logic
We show that a O-l law holds for propositional modal logic, both for structure validity and frame validity. In the case of structure validity, the result follows easily from the well-known O-l law for first-order logic. However, our proof gives considerably more information. It leads to an elegant axiomatization for almost-sure structure validity and to sharper complexity bounds. Since frame va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2000
ISSN: 1077-8926
DOI: 10.37236/1616